منابع مشابه
Probabilistic Optimization Algorithms for Numerical Function Optimization Problems
This paper proposes a novel optimization algorithm called Cellular Probabilistic Optimization Algorithms (CPOA) based on the probabilistic representation of solutions for real coded problems. In place of binary integers, the basic unit of information here is a probability density function. This probabilistic coding allows superposition of states for a more efficient algorithm. This probabilisti...
متن کاملNumerical Optimization with Real-Valued Estimation-of-Distribution Algorithms
In this chapter we focus on the design of real–valued EDAs for the task of numerical optimization. Here, both the problem variables as well as their encoding are real values. Concordantly, the type of probability distribution to be used for estimation and sampling in the EDA is continuous. In this chapter we indicate the main challenges in this area. Furthermore, we review the existing literatu...
متن کاملColumn generation algorithms for nonlinear optimization, II: Numerical investigations
Garcia et al. [1] present a class of column generation (CG) algorithms for nonlinear programs. Its main motivation from a theoretical viewpoint is that under some circumstances, finite convergence can be achieved, in much the same way as for the classic simplicial decomposition method; the main practical motivation is that within the class there are certain nonlinear column generation problems ...
متن کاملDiagonal Crossover in Genetic Algorithms for Numerical Optimization
In this paper the results of a detailed investigation on a multi-parent recombination operator, diagonal crossover, are reported. Although earlier publications have indicated the high performance of diagonal crossover on a number of problems, so far it has not been investigated whether high performance is indeed a result of using a high number of parents. Here we formulate three hypotheses to e...
متن کاملParallel Distance-k Coloring Algorithms for Numerical Optimization
Matrix partitioning problems that arise in the efficient estimation of sparse Jacobians and Hessians can be modeled using variants of graph coloring problems. In a previous work [6], we argue that distance-2 and distance3 2 graph coloring are robust and flexible formulations of the respective matrix estimation problems. The problem size in large-scale optimization contexts makes the matrix esti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1968
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1968.103137